منابع مشابه
Expletive Negation, Negative Concord and Feature Checking*
The aim of this paper is to explore some aspects of the syntax-semantics interface representations which correspond to expletive negation (EN) and negative concord (NC). I shall postulate that a syntactic operation of logical absorption, conceived as feature checking, is needed in the theory of grammar in order to account for both phenomena. EN instantiates a nonnegative context; it will be cha...
متن کاملModel Checking In-The-Loop
Model checkers for program verification have enjoyed considerable success in recent years. In the control systems domain, however, they suffer from an inability to account for the physical environment. For control systems, simulation is the most widely used approach for validating system designs. We present a new technique that uses a software model checker to perform a systematic simulation of...
متن کاملLoop Checking and the Wll-Founded Semantics
Using a calculus of goals, we deene the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the well-founded semantics; for nite programs, it is also complete. A Prolog-style proof search strategy for a modiication of this calculus provides a query evaluation algorithm for nite propositional programs under the well-fou...
متن کاملLoop Checking and the Well-Founded Semantics
Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for finite propositional programs under the we...
متن کاملA Duplication and Loop Checking Free Proof System for S4
Most of the sequent/tableau based proof systems for the modal logic S4 need to duplicate formulas and thus are required to adopt some method of loop checking [7, 13, 10]. In what follows we present a tableau-like proof system for S4, based on D’Agostino and Mondadori’s classical KE [3], which is free of duplication and loop checking. The key feature of this system (let us call it KES4) consists...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1993
ISSN: 0743-1066
DOI: 10.1016/0743-1066(93)90017-b